Implementing Anti-Unification Modulo Equational Theory
نویسندگان
چکیده
We present an implementation of E–anti–unification as defined in [Hei95], where tree–grammar descriptions of equivalence classes of terms are used to compute generalizations modulo equational theories. We discuss several improvements, including an efficient implementation of variable–restricted E–anti–unification from [Hei95], and give some runtime figures about them. We present applications in various areas, including lemma generation in equational inductive proofs, intelligence tests, diverging Knuth–Bendix completion, strengthening of induction hypotheses, and theory formation about finite algebras.
منابع مشابه
Unification and Anti-unification modulo Equational Theories
Automated reasoning modulo an equational theory E is a fundamental technique in many applications. If E can be split as a disjoint union R ∪ Ax in such a way that R is a set of rewrite rules that are confluent, terminating, sort-decreasing, and coherent modulo a set of equational axioms Ax, it is well-known that narrowing with R modulo Ax provides a complete E-unification algorithm. However, na...
متن کاملSolving Proportional Analogies by Application of Anti-Unification modulo Equational Theory
This thesis applies the theory of Anti-Unification modulo Equational Theory (E-Anti-Unification, E-Generalization) to proportional analogies in the string domain. Human solving of proportional analogies of the form A : B :: C : D (read: A is to B like C to D, where A,B and C are given) is modelled by an approach originally developed by Heinz [1996], refined in Burghardt [2005]. The goal is to g...
متن کاملVariant Narrowing and Equational Unification
Narrowing is a well-known complete procedure for equational E-unification when E can be decomposed as a union E = ∆ ] B with B a set of axioms for which a finitary unification algorithm exists, and ∆ a set of confluent, terminating, and B-coherent rewrite rules. However, when B 6= ∅, effective narrowing strategies such as basic narrowing easily fail to be complete and cannot be used. This poses...
متن کاملUnification Modulo an Equality Theory for Equational Logic Programming
Equational logic programming is an extended programming paradigm of equational programming. Central to the notion of equational logic programming is the problem of solving equations, which is also called unification in equational theories. In this paper, we investigate the problem of solving equations in O’Donnell’s equational language. We define an equality theory for this language which adequ...
متن کاملVariants, Unification, Narrowing, and Symbolic Reachability in Maude 2.6
This paper introduces some novel features of Maude 2.6 focusing on the variants of a term. Given an equational theory (Σ,Ax∪E), the E,Ax-variants of a term t are understood as the set of all pairs consisting of a substitution σ and the E,Ax-canonical form of tσ . The equational theory (Ax∪E) has the finite variant property iff there is a finite set of most general variants. We have added suppor...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1404.0953 شماره
صفحات -
تاریخ انتشار 2014